-
1 задача линейной минимизации
Mathematics: LMP (linear minimization problem)Универсальный русско-английский словарь > задача линейной минимизации
-
2 основная задача
= прямая задача primal problemБолее интересный результат относительно задачи линейного программирования заключается в том, что с ней можно связать другую задачу линейного программирования, которая называется двойственной и имеет вид задачи минимизации с К переменными (по одной для каждого ограничения исходной или прямой задачи) и N ограничениями (по одному для каждой переменной прямой задачи). — A more interesting fact about the linear programming problem is that with it we can associate another linear programming problem, called the dual problem, that has the form of a minimization problem with K variables (one for each constraint of the original, or primal, problem) and N constraints (one for each variable of the primal problem).
Russian-English Dictionary "Microeconomics" > основная задача
См. также в других словарях:
Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… … Wikipedia
Linear least squares (mathematics) — This article is about the mathematics that underlie curve fitting using linear least squares. For statistical regression analysis using least squares, see linear regression. For linear regression on a single variable, see simple linear regression … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
Linear matrix inequality — In convex optimization, a linear matrix inequality (LMI) is an expression of the form: LMI(y):=A 0+y 1A 1+y 2A 2+cdots+y m A mgeq0,where * y= [y i,, i!=!1dots m] is a real vector, * A 0,, A 1,, A 2,,dots,A m are symmetric matrices in the subspace … Wikipedia
Dual problem — In constrained optimization, it is often possible to convert the primal problem (i.e. the original form of the optimization problem) to a dual form, which is termed a dual problem. Usually dual problem refers to the Lagrangian dual problem but… … Wikipedia
Filtering problem (stochastic processes) — In the theory of stochastic processes, the filtering problem is a mathematical model for a number of filtering problems in signal processing and the like. The general idea is to form some kind of best estimate for the true value of some system,… … Wikipedia
Simple linear regression — A simple linear regression is a linear regression in which there is only one covariate (predictor variable). Simple linear regression is a form of multiple regression. Simple linear regression is used in situations to evaluate the linear… … Wikipedia
Least-squares estimation of linear regression coefficients — In parametric statistics, the least squares estimator is often used to estimate the coefficients of a linear regression. The least squares estimator optimizes a certain criterion (namely it minimizes the sum of the square of the residuals). In… … Wikipedia
Covering problem — In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure covers another, or how large the structure has to be to do that. Covering problems are minimization problems… … Wikipedia
Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia